Weak Completeness Notions for Exponential Time
نویسندگان
چکیده
منابع مشابه
Weak completeness notions for exponential time
Lutz [20] proposed the following generalization of hardness: While a problem A is hard for a complexity class C if all problems in C can be reduced to A, Lutz calls a problem weakly hard if a nonnegligible part of the problems in C can be reduced to A. For the linear exponential-time class E = DTIME(2), Lutz formalized these ideas by introducing a resource-bounded (pseudo) measure on this class...
متن کاملA Comparison of Weak Completeness Notions 1 Extended
We compare the weak completeness notions for E in the sense of Lutz's resource-bounded measure theory 11] with respect to the standard polynomial time reducibilities. Our results parallel results for classical completeness by Watanabe 17] and others. We show that the weak completeness notions for 1-query reductions coincide: A set is weakly complete for E under 1-truth-table reducibility ii it ...
متن کاملNontriviality for Exponential Time w.r.t. Weak Reducibilities
A set A is nontrivial for the linear exponential time class E = DTIME(2) if A ∈ E and the sets from E which can be reduced to A are not from a single level DTIME(2) of the linear exponential hierarchy. Similarly, a set A is nontrivial for the polynomial exponential time class EXP = DTIME(2) if A ∈ EXP and the sets from EXP which can be reduced to A are not from a single level DTIME(2 k ) of the...
متن کاملSeparation of NP-Completeness Notions
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is T-complete but not P tt -complete. We provide fairly thorough analyses of the hypotheses that we introduce.
متن کاملOn Exponential - Time Completeness of the Circularity Problem for Attribute
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. They reduced the acceptance problems of above automata, which are exponential-time (EXPTIME) complete, to the AG circularity problem. These pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2019
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09920-4